/**
 * @file   1073.cpp
 * @author Shuang Hu <hsmath@ubuntu>
 * @date   Tue Apr 13 23:33:08 2021
 * 
 * @brief  PAT Problem 1073,scientific notation
 * @time 50 minutes(Too SLOW!)
 * 
 */
#include<iostream>
#include<string>
using namespace std;
bool positive;
void print1(string s,int pos,int power);
void print2(string s,int pos,int power);
int main(){
    string s;
    cin>>s;
    if(s[0]=='+'){
	positive=true;
    }else if(s[0]=='-'){
	positive=false;
    }
    int pos=0;
    for(int i=0;i<s.length();i++){
	if(s[i]=='E'){
	    pos=i;
	    break;
	}
    }
    int power=0;
    if(s[pos+1]=='-'){
	for(int i=pos+2;i<s.length();i++){
	    power=power*10;
	    power=power-(s[i]-'0');
	}
    }
    else{
	for(int i=pos+2;i<s.length();i++){
	    power=power*10;
	    power=power+s[i]-'0';
	}
    }
    int dotpos=0;
    for(int i=0;i<s.length();i++){
	if(s[i]=='.'){
	    dotpos=i;
	    break;
	}
    }
    if(power>0){
	if(positive==false){
	    cout<<"-";
	}
	for(int i=1;i<dotpos;i++){
	    static int flag=0;
	    if(flag==0&&s[i]=='0'){
		continue;
	    }
	    cout<<s[i];
	    flag=1;
	}
	print1(s,dotpos+1,power);
    }
    else if(power<0){
	print2(s,dotpos,power);
    }else{
	if(positive==false){
	    cout<<"-";
	}
	for(int i=1;s[i]!='E';i++){
	    cout<<s[i];
	}
	cout<<endl;
    }
}
void print1(string s,int pos,int power){
    int i=pos;
    while(s[i]!='E'&&power>0){
	cout<<s[i];
	i++;
	power--;
    }
    if(power==0&&s[i]!='E'){
	cout<<'.';
	for(;s[i]!='E';i++){
	    cout<<s[i];
	}
    }
    for(int i=power;i>0;i--){
	cout<<"0";
    }
    cout<<endl;
}
void print2(string s,int pos,int power){
    if(positive==false){
	cout<<'-';
    }
    int beforedot=pos-1;
    int zeroes=(-power)-beforedot;
    if(zeroes>=0){
	cout<<"0.";
	for(int i=0;i<zeroes;i++){
	    cout<<"0";
	}
	for(int i=1;s[i]!='E';i++){
	    if(s[i]!='.'){
		cout<<s[i];
	    }
	}
    }else{
	pos=pos-power;
	for(int i=1;i<pos;i++){
	    cout<<s[i];
	}
	cout<<".";
	for(int i=pos;s[i]!='E';i++){
	    if(s[i]!='.'){
		cout<<s[i];
	    }
	}
    }
    cout<<endl;
}
